On Maximal Distance Energy

Let G be a graph of order n. If the maximal connected subgraph has no cut vertex then it is called block. each block clique tree. The distance energy ED(G) sum absolute values eigenvalues matrix D(G). In this paper, we study properties on eigencomponents corresponding to spectral radius some special class trees. Using result characterize which gives maximum among all trees n with k cliques. From result, confirm conjecture energy, was given in Lin et al. Linear Algebra Appl 467(2015) 29-39.